Kinetic Visibility

In this paper, we survey kinetic visibility problems. Unlike the research in traditional visibility problems, the researchers have also taken moving objects into consideration. These problems have been addressed from different practical aspects, such as computational graphics and robotic design. Over the years, some general combinatorial results of the visibility graph have been shown. Leveraging temporal coherence has been used in kinetic visibility studies for different scenes. Data structures that have been developed to support the kinetic operations, and kinetic algorithms that have been designed to achieve efficient visibility computation and maintanence are reviewed in this paper. Open problems related with kinetic visibility will be addressed from different perspectives. Both theoretical and practical work needs to be done in future studies.